Damage spreading and criticality in finite random dynamical networks.
نویسندگان
چکیده
We systematically study and compare damage spreading at the sparse percolation (SP) limit for random Boolean and threshold networks with perturbations that are independent of the network size N. This limit is relevant to information and damage propagation in many technological and natural networks. Using finite-size scaling, we identify a new characteristic connectivity Ks, at which the average number of damaged nodes d[over ], after a large number of dynamical updates, is independent of N. Based on marginal damage spreading, we determine the critical connectivity Kc(sparse)(N) for finite N at the SP limit and show that it systematically deviates from Kc, established by the annealed approximation, even for large system sizes. Our findings can potentially explain the results recently obtained for gene regulatory networks and have important implications for the evolution of dynamical networks that solve specific tasks.
منابع مشابه
Criticality in random threshold networks: annealed approximation and beyond
Random Threshold Networks with sparse, asymmetric connections show complex dynamical behavior similar to Random Boolean Networks, with a transition from ordered to chaotic dynamics at a critical average connectivity Kc. In this type of model—contrary to Boolean Networks—propagation of local perturbations (damage) depends on the in-degree of the sites. Kc is determined analytically, using an ann...
متن کاملWhen correlations matter - response of dynamical networks to small perturbations
We systematically study and compare damage spreading for random Boolean and threshold networks under small external perturbations (damage), a problem which is relevant to many biological networks. We identify a new characteristic connectivityKs, at which the average number of damaged nodes after a large number of dynamical updates is independent of the total number of nodes N . We estimate the ...
متن کاملOptimal system size for complex dynamics in random neural networks near criticality.
In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259-262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a nove...
متن کاملSelf-organized criticality and adaptation in discrete dynamical networks
It has been proposed that adaptation in complex systems is optimized at the critical boundary between ordered and disordered dynamical regimes. Here, we review models of evolving dynamical networks that lead to self-organization of network topology based on a local coupling between a dynamical order parameter and rewiring of network connectivity, with convergence towards criticality in the limi...
متن کاملDynamical impact of individual nodes in Boolean network dynamics
Boolean networks serve as discrete models of regulation and signaling in biological cells. Identifying the key controllers of such processes is important for understanding the dynamical systems and planning further analysis. Here we quantify the dynamical impact of a node as the probability of damage spreading after switching the node’s state. We find that the leading eigenvector of the adjacen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 99 24 شماره
صفحات -
تاریخ انتشار 2007